Fast Sweeping Methods for Static Hamilton-Jacobi Equations
نویسندگان
چکیده
We propose a new sweeping algorithm which discretizes the Legendre transform of the numerical Hamiltonian using an explicit formula. This formula yields the numerical solution at a grid point using only its immediate neighboring grid values and is easy to implement numerically. The minimization that is related to the Legendre transform in our sweeping scheme can either be solved analytically or numerically. We illustrate the efficiency and accuracy approach with several numerical examples in 2D and 3D.
منابع مشابه
A Fast Sweeping Method for Static Convex Hamilton-Jacobi Equations
We develop a fast sweeping method for static Hamilton-Jacobi equations with convex Hamiltonians. Local solvers and fast sweeping strategies apply to structured and unstructured meshes. With causality correctly enforced during sweepings numerical evidence indicates that the fast sweeping method converges in a finite number of iterations independent of mesh size. Numerical examples validate both ...
متن کاملHigh Order Fast Sweeping Methods for Static Hamilton-Jacobi Equations
We construct high order fast sweeping numerical methods for computing viscosity solutions of static Hamilton-Jacobi equations on rectangular grids. These methods combine high order weighted essentially non-oscillatory (WENO) approximation to derivatives, monotone numerical Hamiltonians and Gauss Seidel iterations with alternating-direction sweepings. Based on well-developed first order sweeping...
متن کاملConvergence analysis of the fast sweeping method for static convex Hamilton–Jacobi equations
In this work, we study the convergence of an efficient iterative method, the fast sweeping method (FSM), for numerically solving static convex Hamilton–Jacobi equations. First, we show the convergence of the FSM on arbitrary meshes. Then we illustrate that the combination of a contraction property of monotone upwind schemes with proper orderings can provide fast convergence for iterative method...
متن کاملFixed-point Fast Sweeping Weno Methods for Steady State Solution of Scalar Hyperbolic Conservation Laws
Fast sweeping methods were developed in the literature to efficiently solve static Hamilton-Jacobi equations. This class of methods utilize the Gauss-Seidel iterations and alternating sweeping strategy to achieve fast convergence rate. They take advantage of the properties of hyperbolic partial differential equations (PDEs) and try to cover a family of characteristics of the corresponding Hamil...
متن کاملA Stopping Criterion for Higher-order Sweeping Schemes for Static Hamilton-jacobi Equations
We propose an effective stopping criterion for higher-order fast sweeping schemes for static Hamilton-Jacobi equations based on ratios of three consecutive iterations. To design the new stopping criterion we analyze the convergence of the first-order Lax-Friedrichs sweeping scheme by using the theory of nonlinear iteration. In addition, we propose a fifth-order Weighted PowerENO sweeping scheme...
متن کاملLax – Friedrichs sweeping scheme for static Hamilton – Jacobi equations q
We propose a simple, fast sweeping method based on the Lax–Friedrichs monotone numerical Hamiltonian to approximate viscosity solutions of arbitrary static Hamilton–Jacobi equations in any number of spatial dimensions. By using the Lax–Friedrichs numerical Hamiltonian, we can easily obtain the solution at a specific grid point in terms of its neighbors, so that a Gauss–Seidel type nonlinear ite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Numerical Analysis
دوره 42 شماره
صفحات -
تاریخ انتشار 2005